Max-leaves spanning tree is APX-hard for cubic graphs
نویسندگان
چکیده
منابع مشابه
Max-leaves spanning tree is APX-hard for cubic graphs
We consider the problem of finding a spanning tree with maximum number of leaves (MaxLeaf). A 2-approximation algorithm is known for this problem, and a 3/2-approximation algorithm when restricted to graphs where every vertex has degree 3 (cubic graphs). MaxLeaf is known to be APX-hard in general, and NP-hard for cubic graphs. We show that the problem is also APX-hard for cubic graphs. The APX-...
متن کاملCrossing Number Is Hard for Cubic Graphs
It was proved by [Garey and Johnson, 1983] that computing the crossing number of a graph is an NP -hard problem. Their reduction, however, used parallel edges and vertices of very high degrees. We prove here that it is NP -hard to determine the crossing number of a simple cubic graph. In particular, this implies that the minor-monotone version of crossing number is also NP -hard, which has been...
متن کاملA note on max-leaves spanning tree problem in Halin graphs
A Halin graph H is a planar graph obtained by drawing a tree T in the plane, where T has no vertex of degree 2, then drawing a cycle C through all leaves in the plane. We write H = T ∪ C, where T is called the characteristic tree and C is called the accompanying cycle. The problem is to find a spanning tree with the maximum number of leaves in a Halin graph. In this paper, we prove that the cha...
متن کاملClique in 3-track interval graphs is APX-hard
Butman, Hermelin, Lewenstein, and Rawitz proved that CLIQUE in t-interval graphs is NP-hard for t ≥ 3. We strengthen this result to show that CLIQUE in 3-track interval graphs is APX-hard.
متن کاملAnonymizing Binary Tables is APX-hard
The problem of publishing personal data without giving up privacy is increasingly important. An interesting formalization is the k-anonymization, where all rows in a table are clustered in sets of at least k records, and all the entries for which records in the same cluster have different values are suppressed. The problem has been shown to be NP-hard when the records values are over a ternary ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2012
ISSN: 1570-8667
DOI: 10.1016/j.jda.2011.06.005